ISRO CSE 2014
Q31.
If each address space represents one byte of storage space, how many address lines are needed to access RAM chips arranged in a 4 \times 6 array, where each chip is 8K \times 4 bits ?Q32.
A computer has 16 pages of virtual address space but the size of main memory is only four frames. Initially the memory is empty. A program references the virtual pages in the order 0, 2, 4, 5, 2, 4, 3, 11, 2, 10. How many page faults occur if LRU page replacement algorithm is used?Q33.
What is the size of the physical address space in a paging system which has a page table containing 64 entries of 11 bit each (including valid and invalid bit) and a page size of 512 bytes?Q34.
Consider the following segment table in segmentation scheme :\begin{array}{|l|l|l|} \hline \text { Segment ID } & \text { Base } & \text { Limit } \\ \hline 0 & 200 & 200 \\ \hline 1 & 5000 & 1210 \\ \hline 2 & 1527 & 498 \\ \hline 3 & 2500 & 50 \\ \hline \end{array}What happens if the logical address requested is - Segment Id 2 and offset 1000?Q35.
Using the page table shown below, translate the physical address 25 to virtual address. The address length is 16 bits and page size is 2048 words while the size of the physical memory is four frames.\begin{array}{lcc} \text { Page } & \text { Present }(1-In , 0-Out) & \text { Frame } \\ 0 & 1 & 3 \\ 1 & 1 & 2 \\ 2 & 1 & 0 \\ 3 & 0 & - \end{array}Q37.
Consider the following Deterministic Finite Automaton M.Let S denote the set of eight bit strings whose second, third, sixth and seventh bits are 1. The number of strings in S that are accepted by M isQ39.
How many states are there in a minimum state deterministic finite automaton accepting the language L=\left\{w \mid w \in\{0,1\}^{*}\right., number of 0's is divisible by 2 and number of 1's is divisible by 5, respectively }?Q40.
The number of states required by a Finite State Machine,to simulate the behavior of a computer with a memory capable of storing 'm' words, each of length 'n' bits is?